Covering Fairness against Conspiracies
نویسنده
چکیده
The paper takes advantage and develops the fundamental Best’s ideas about fairness hierarchy and conspiracies in concurrent systems. Near to the start we characterize liveness with the notion of ∞-fairness. Next we show that the conspiracy-freeness problem is decidable for elementary nets and undecidable for place/transition nets. The main aim of the paper was to put places into work against conspiracies. We show, how marking fairness effectively fights with conspiracies in elementary nets. Next, we introduce the notion of covering fairness, as a tool against conspiracies in place/transition systems. Results of the paper say that one can ensure global fairness on a local level of executions of the systems.
منابع مشابه
Best Fairness Hierarchy in Elementary Nets
The fairness hierarchy and conspiracies, the notions introduced by Best, are studied in the context of elementary nets. Proving that sequential as well as persistent systems are conspiracy-free, we indicate two main roots of conspiracies: distributed memory and conflicts. Using the notion of markingfairness, due to Merceron, we prove that T0-fairness + M0-fairness = T∞fairness. This result give...
متن کاملThe Role of Historical Knowledge in Perception of Race-Based Conspiracies
We test the hypothesis that knowledge of historically documented, anti-black conspiracies affects perceived plausibility of new, anti-black conspiracies. In Experiment 1 (N = 78), African Americans and European Americans read about a current conspiracy aimed at undermining either African American or European American–elected officials. African Americans perceived the anti-black conspiracy as mo...
متن کاملDistributed, Expressive Top-k Subscription Filtering using Covering in Publish/Subscribe Systems
Top-k filtering is an effective way of reducing the amount of data sent to subscribers in pub/sub applications. In this paper, we investigate top-k subscription filtering, where a publication is delivered only to the k best ranked subscribers. The naive approach to perform filtering early at the publisher edge broker works only if complete knowledge of the subscriptions is available, which is n...
متن کاملImproving Tor security against timing and traffic analysis attacks with fair randomization
The Tor network is probably one of the most popular online anonymity systems in the world. It has been built based on the volunteer relays from all around the world. It has a strong scientific basis which is structured very well to work in low latency mode that makes it suitable for tasks such as web browsing. Despite the advantages, the low latency also makes Tor insecure against timing and tr...
متن کامل'They will not control us': Ingroup positivity and belief in intergroup conspiracies.
This research examined the role of different forms of positive regard for the ingroup in predicting beliefs in intergroup conspiracies. Collective narcissism reflects a belief in ingroup greatness contingent on others' recognition. We hypothesized that collective narcissism should be especially likely to foster outgroup conspiracy beliefs. Non-narcissistic ingroup positivity, on the other hand,...
متن کامل